منابع مشابه
Resolvability and Monotone Normality
A space X is said to be κ-resolvable (resp. almost κ-resolvable) if it contains κ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). X is maximally resolvable iff it is ∆(X)-resolvable, where ∆(X) = min{|G| : G 6= ∅ open}. We show that every crowded monotonically normal (in short: MN) space is ω-resolvable and almost μ-resolvable, where μ = mi...
متن کاملAcyclic monotone normality
Moody, P. J. and A. W. Roscoe, Acyclic monotone normality, Topology and its Applications 47 (1992) 53-67. A space X is acyclic monotonically normal if it has a monotonically normal operator M(., .) such that for distinct points x,,, ,x._, in X and x, =x,], n::i M(x,, X\{x,+,}) = (d. It is a property which arises from the study of monotone normality and the condition “chain (F)“. In this paper i...
متن کاملMonotone versions of δ-normality
According to Mack a space is countably paracompact if and only if its product with [0, 1] is δ-normal, i.e. any two disjoint closed sets, one of which is a regular Gδ-set, can be separated. In studying monotone versions of countable paracompactness, one is naturally led to consider various monotone versions of δ-normality. Such properties are the subject of this paper. We look at how these prop...
متن کاملResolvability of Infinite Designs
In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t-(v, k,Λ) design with t finite, v infinite and k, λ < v is resolvable and, in fact, has α orthogonal resolutions for each α < v. We also show that, while a t-(v, k,Λ) design with t and λ finite, v infini...
متن کاملResolvability on Continuous Alphabets
We characterize the resolvability region for a large class of point-to-point channels with continuous alphabets. In our direct result, we prove not only the existence of good resolvability codebooks, but adapt an approach based on the Chernoff-Hoeffding bound to the continuous case showing that the probability of drawing an unsuitable codebook is doubly exponentially small. For the converse par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2008
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-008-1017-y